Event-Clock Nested Automata
نویسندگان
چکیده
In this paper we introduce and study Event-Clock Nested Automata (ECNA), a formalism that combines Event Clock Automata (ECA) and Visibly Pushdown Automata (VPA). ECNA allow to express real-time properties over non-regular patterns of recursive programs. We prove that ECNA retain the closure and decidability properties of ECA and VPA being closed under Boolean operations and having a decidable language-inclusion problem. In particular, we prove that emptiness, universality, and language-inclusion for ECNA are Exptime-complete problems. As for the expressiveness, we have that ECNA properly extend any previous attempt in the literature of combining ECA and VPA.
منابع مشابه
Event-Clock Visibly Pushdown Automata
Event-clock automata is a determinizable subclass of timed automata, where the clock valuations are determined by the input instead of by the transition relation. In this note, we propose event-clock visibly pushdown automata (ECVPAs) as a proper extension of event-clock automata. The class of ECVPAs is sufficiently expressive to model real-time pushdown systems, and to specify common non-regul...
متن کاملA Kleene-Schützenberger Theorem for Weighted Event-Clock Automata
We present a Kleene-Schützenberger-Theorem for weighted event-clock automata, i.e., we show that the class of recognizable timed series coincides with the class of rational timed series. The result generalizes Kleene’s famous theorem and its extensions to the classes of weighted automata and event-clock automata. For proving the theorem, we use the method of a recent work on the class of weight...
متن کاملEvent-Clock Automata: A Determinizable Class of Timed Automata
We introduce event-recording automata. An event-recording automaton is a timed automaton that contains, for every event a, a clock that records the time of the last occurrence of a. The class of event-recording automata is, on one hand, expressive enough to model ( nite) timed transition systems and, on the other hand, determinizable and closed under all boolean operations. As a result, the lan...
متن کاملState Clock Logic : a Decidable Real-time Logic State Clock Logic: a Decidable Real-time Logic ?
In this paper we deene a real-time logic called SC logic. This logic is deened in the framework of State Clock automata, the state variant of the Event Clock automata of Alur et al 6]. Unlike timed automata 4], they are complementable and thus language inclusion becomes decidable. SC automata and SC logic are less expressive than timed automata and MITL but seem expressive enough in practice. A...
متن کاملOn Termination and Boundedness of Nested Updatable Timed Automata
We introduce a model named nested updatable timed automata (NeUTAs), which can be regarded as a combination of nested timed automata (NeTAs) and updatable timed automata with one updatable clock (UTA1s). The model is suitable for soft real-time system analysis, since the updatable clock representing a deadline can be updated due to environments. A NeUTA behaves as a UTA1, in which all clocks ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2018